Matching Point-sets using Procrustes Alignment and the EM Algorithm
نویسندگان
چکیده
This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm. The aim is to improve the robustness of the Procrustes alignment to noise and clutter. By constructing a Gaussian mixture model over the missing correspondences between individual points, we show how alignment can be realised by applying singular value decomposition to a weighted point correlation matrix. Moreover, by gauging the relational consistency of the assigned correspondence matches, we can edit the point sets to remove clutter. We illustrate the effectiveness of the method on matching stereograms. We also provide a sensitivity analysis to demonstrate the operational advantages of the method.
منابع مشابه
Iterative Procrustes alignment with the EM algorithm
This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm. The aim is to improve the robustness of the Procrustes alignment to noise and clutter. By constructing a Gaussian mixture model over the missing correspondences between individual points, we show how alignment can be realised by applying singular value decompos...
متن کاملPart-based Probabilistic Point Matching using Equivalence Constraints
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transformations, where the parts themselves are learnt during matching. Ideas from semi-supervised learning are used to bias the algorithm towards finding ‘perceptually valid’ part structures. Shapes are represented by unlabel...
متن کاملBayesian Matching of Unlabeled Marked Point Sets Using Random Fields , with an Application to Molecular Alignment
Statistical methodology is proposed for comparing unlabeled marked point sets, with an application to aligning steroid molecules in chemoinformatics. Methods from statistical shape analysis are combined with techniques for predicting random fields in spatial statistics in order to define a suitable measure of similarity between two marked point sets. Bayesian modeling of the predicted field ove...
متن کاملThe Softassign Procrustes Matching Algorithm
The problem of matching shapes parameterized as a set of points is frequently encountered in medical imaging tasks. When the point-sets are derived from landmarks, there is usually no problem of determining the correspondences or homologies between the two sets of landmarks. However, when the point sets are automatically derived from images, the diicult problem of establishing correspondence an...
متن کاملA unified framework for alignment and correspondence
This paper casts the problem of 2D point-set alignment and correspondence matching into a unified framework. Our aim in providing this unification is to constrain the recovery of pose parameters using relational constraints provided by the structural arrangement of the points. This structural information is provided by a neighbourhood graph for the points. We characterise the problem using dist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999